Iterative Widening
نویسنده
چکیده
We propose a method to gradually expand the moves to consider at the nodes of game search trees. The algorithm begins with an iterative deepening search using the minimal set of moves, and if the search does not succeed, iteratively widens the set of possible moves, performing a complete iterative deepening search after each widening. When designing carefully the different sets of possible moves, the algorithm can save some time in the game of Go tree search, as shown by experimental results.
منابع مشابه
Generalized Widening
We present a new threat based search algorithm that outperforms other threat based search algorithms and selective knowledge-based for open life and death problem solving in the game of Go. It generalizes the Iterative Widening algorithm which consists in iteratively increasing the threat searched at the root. The main idea of Generalized Widening is to perform Iterative Widening at all max nod...
متن کاملGuided Static Analysis
Abstract. In static analysis, the semantics of the program is expressed as a set of equations. The equations are solved iteratively over some abstract domain. If the abstract domain is distributive and satisfies the ascending-chain condition, an iterative technique yields the most precise solution for the equations. However, if the above properties are not satisfied, the solution obtained is ty...
متن کاملCombining Widening and Acceleration in Linear Relation Analysis
Linear Relation Analysis [CH78,Hal79] is one of the first, but still one of the most powerful, abstract interpretations working in an infinite lattice. As such, it makes use of a widening operator to enforce the convergence of fixpoint computations. While the approximation due to widening can be arbitrarily refined by delaying the application of widening, the analysis quickly becomes too expens...
متن کاملCombining Model and Iterative Compilation for Program Performance Optimization
The performance gap for high performance applications has been widening over time. High level program transformations are critical to improve applications’ performance, many of which concern the determination of optimal values for transformation parameters, such as loop unrolling and blocking. Static approaches achieve these values based on analytical models that are hard to achieve because of ...
متن کاملValues of the Merging Function and Algorithm Design as a Game
| Finding algorithms that are optimal for worst case input is equivalent to solving a 2-player game of perfect information. The merging game arises when nding the minimum number M(m; n) of comparisons needed to merge two sorted lists of cardi-nalities m and n. We devised a computer program capable of determining any value of M(m; n) 20. It was based on standard game solving techniques (alpha-be...
متن کامل